A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points

نویسندگان

  • Laurent Bienvenu
  • Adam R. Day
  • Mathieu Hoyrup
  • Ilya Mezhirov
  • Alexander Shen
چکیده

We prove the effective version of Birkhoff’s ergodic theorem for Martin-Löf random points and effectively open sets, improving the results previously obtained in this direction (in particular those of V. Vyugin, Nandakumar and Hoyrup, Rojas). The proof consists of two steps. First, we prove a generalization of Kučera’s theorem, which is a particular case of effective ergodic theorem: a trajectory of a computable ergodic mapping that starts from a random point cannot remain inside an effectively open set of measure less than 1. Second, we show that the full statement of the effective ergodic theorem can be reduced to this special case. Both steps use the statement of classical ergodic theorem but not its usual classical proof. Therefore, we get a new simple proof of the effective ergodic theorem (with weaker assumptions than before). This result was recently obtained independently by Franklin, Greenberg, Miller and Ng.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The dimension of ergodic random sequences

Let μ be a computable ergodic shift-invariant measure over {0, 1} . Providing a constructive proof of Shannon-McMillan-Breiman theorem, V’yugin proved that if x ∈ {0, 1} is Martin-Löf random w.r.t. μ then the strong effective dimension Dim(x) of x equals the entropy of μ. Whether its effective dimension dim(x) also equals the entropy was left as an problem question. In this paper we settle this...

متن کامل

Applications of Effective Probability Theory to Martin-Löf Randomness

We pursue the study of the framework of layerwise computability introduced in [HR09a] and give three applications. (i) We prove a general version of Birkhoff’s ergodic theorem for random points, where the transformation and the observable are supposed to be effectively measurable instead of computable. This result significantly improves [V’y97, Nan08]. (ii) We provide a general framework for de...

متن کامل

Randomness and the Ergodic Decomposition

We briefly present ongoing work about Martin-Löf randomness and the ergodic decomposition theorem. In [ML66], Martin-Löf defined the notion of an algorithmically random infinite binary sequence. The idea was to have an individual notion of a random object, an object that is acceptable as an outcome of a probabilistic process (typically, the tossing of a coin). This notion has proved successful,...

متن کامل

. L O ] 1 2 Ju n 20 12 RANDOMNESS AND NON - ERGODIC SYSTEMS

We characterize the points that satisfy Birkhoff’s ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space is not Martin-Löf random, there is a computable measure-preserving transformation and a computable set that witness that x is not typical with respect to the...

متن کامل

Ergodic-Type Characterizations of Algorithmic Randomness

A theorem of Kučera states that given a Martin-Löf random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A. We show that this result can be seen as an effective version of Birkhoff’s ergodic theorem (in a special case). We prove several results in the same spirit and generalize them via an effective ergodic theorem for bijective ergodic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 210  شماره 

صفحات  -

تاریخ انتشار 2012